Bounded Stacks, Bags and Queues
نویسندگان
چکیده
We prove that a bounded stack can be specified in process algebra with just the operators alternative and sequential composition and iteration. The bounded bag cannot be specified with these operators, but can be specified if we add the parallel composition operator without communication (free merge). The bounded queue cannot even be specified in this signature; we need a form of variable binding such as given by general communication and encapsulation, the state operator, or abstraction.
منابع مشابه
Can Message Buffers Be Axiomatized in Linear Temporal Logic?
Message passing is one of the primary modes of interprocess communication in a distributed system. In this paper we investigate the possibility of characterizing and axiomatizing different message passing systems in temporal logic. Specifically, we consider FIFO buffers (queues), LIFO buffers (stacks) and unordered buffers (bags). We show that all bounded buffers are characterizable in proposit...
متن کاملThe combinatorics of some abstract data types
Abstract data types (ADTs) may be regarded as abstract machines and then a program for an ADT is any sequence of operations allowed by its specification. The effect of such programs on container ADTs is captured by the relationship between each input sequence and the set of possible output sequences that can result from it. This relationship is studied principally in the case of dictionaries, s...
متن کاملA Shared Object Environment for Developing Distributed Applications
This paper presents an environment support for developing distributed applications (ESDDA) in the form of a library. It supports programming through shared objects. The environment provides a collection of predefined classes through which users can instantiate objects that can be accessed from any machine transparently in a distributed network environment. The classes refer to common data struc...
متن کاملPractical Memory Checkers for Stacks, Queues and Deques
A memory checker for a data structure provides a method to check that the output of the data structure operations is consistent with the input even if the data is stored on some insecure medium. In 8] we present a general solution for all data structures that are based on insert(i; v) and delete(j) commands. In particular this includes stacks, queues, deques (double-ended queues) and lists. Her...
متن کاملZigzag Stacks and m-Regular Linear Stacks
The contact map of a protein fold is a graph that represents the patterns of contacts in the fold. It is known that the contact map can be decomposed into stacks and queues. RNA secondary structures are special stacks in which the degree of each vertex is at most one and each arc has length of at least two. Waterman and Smith derived a formula for the number of RNA secondary structures of lengt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997